A Performance Study of Run-time Systems for Distributed Time Warp Simulation
نویسندگان
چکیده
Parallel discrete event simulation (PDES) is a basic approach for evaluation of complex systems. A PDES attempts to speed up the execution of a simulation by distributing the simulation’s workload between multiple processors. A network of workstations is a widely available platform for PDES. The present article provides a comparative analysis of operational distributed simulation models based on the Time Warp algorithm. An operational model allowing for reduction of the simulation costs has been proposed based on an experimental evaluation.
منابع مشابه
Trade-Off between Sequential and Time Warp-Based Parallel Simulation
Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations have to be usually run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper we analyze the Time Warp synchronization protocol for parallel discrete event...
متن کاملPerformance of Time Warp Protocols for Transaction Management in Object Oriented Systems
It has been pointed out (e.g., by Richard Fujimoto) that protocols developed for the difficult problem of parallel and distributed simulation can also be adapted to other distributed applications. Indeed, in the mid 1980’s David Jefferson adapted his Time Warp protocol to the problem of database concurrency control. In the present work, we consider our own variants of the Time Warp for database...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملOn Rolling Back and Checkpointing in Time Warp
ÐIn this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back Time Warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs ...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کامل